☆
1

Authors:
Frank Ruskey
Liked by: Sergey Kirgizov
Domains: Discrete mathematics, Combinatorics
Tags: book, combinatorics, generation, Gray code
Liked by: Sergey Kirgizov
Domains: Discrete mathematics, Combinatorics
Tags: book, combinatorics, generation, Gray code
Uploaded by:
Sergey Kirgizov
Upload date: 2020-06-09 21:24:25
Upload date: 2020-06-09 21:24:25
Comments:
How to efficiently generate combinatorial structures such as posets, trees, B-trees, graphs, permutations, set partitions, Dyck paths, multisets or necklaces ... ? The Ruskey's book gives answers. It contains many surprising descriptions (and bibliographic references) of constant amortized time (CAT) and loopless algorithms.
Ruskey's book, page 8
https://en.wikipedia.org/wiki/Loopless_algorithm
Edited by Sergey Kirgizov at 2020-06-10 21:20:27